COMPUTATIONAL IMPLICATIONS OF REDUCING DATA TO SUFFICIENT STATISTICS By
نویسنده
چکیده
Given a large dataset and an estimation task, it is common to pre-process the data by reducing them to a set of sufficient statistics. This step is often regarded as straightforward and advantageous (in that it simplifies statistical analysis). I show that –on the contrary– reducing data to sufficient statistics can change a computationally tractable estimation problem into an intractable one. I discuss connections with recent work in theoretical computer science, and implications for some techniques to estimate graphical models.
منابع مشابه
Computational Implications of Reducing Data to Sufficient Statistics
Given a large dataset and an estimation task, it is common to pre-process the data by reducing them to a set of sufficient statistics. This step is often regarded as straightforward and advantageous (in that it simplifies statistical analysis). I show that –on the contrary– reducing data to sufficient statistics can change a computationally tractable estimation problem into an intractable one. ...
متن کاملThe specification of rank reducing observation sets in experimental design
If observations are lost from an experiment involving one or more forms of blocking, it can happen that the resultant design is treatment disconnected which has serious implications for the experiment. A method is described in this paper for specifying each set of observations which has the property that a treatment disconnected design will result if this observation set is missing. Some implic...
متن کاملA sequential test for variable selection in high dimensional complex data
Given a high dimensional p-vector of continuous predictors X and a univariate response Y , principal fitted components (PFC) provide a sufficient reduction of X that retains all regression information about Y in X while reducing the dimensionality. The reduction is a set of linear combinations of all the p predictors, where with the use of a flexible set of basis functions, predictors related t...
متن کاملUniversal Approximation of Interval-valued Fuzzy Systems Based on Interval-valued Implications
It is firstly proved that the multi-input-single-output (MISO) fuzzy systems based on interval-valued $R$- and $S$-implications can approximate any continuous function defined on a compact set to arbitrary accuracy. A formula to compute the lower upper bounds on the number of interval-valued fuzzy sets needed to achieve a pre-specified approximation accuracy for an arbitrary multivariate con...
متن کاملStability and numerical solution of time variant linear systems with delay in both the state and control
In this paper, stability for uncertain time variant linear systems with time delay is studied. A new sufficient condition for delay-dependent systems is given in matrix inequality form which depends on the range of delay. Then, we introduce a new direct computational method to solve delay systems. This method consists of reducing the delay problem to a set of algebraic equations by first expand...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014